Towards a Logical Semantics for Pure Prolog
نویسندگان
چکیده
The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-rst left-to-right evaluation strategy of Prolog interpreters. We propose a semantics for Prolog programs based on a four-valued logic. The semantics is based on a new concept of completion analogous to Clark's and it enjoys the nice properties of the declarative semantics of logic programming: existence of the least Herbrand model, equivalence of the model-theoretic and operational semantics.
منابع مشابه
Programming Towards a Roberto Barbuti ” , logical semantics for pure Prolog ’
The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-first left-to-right evaluation strategy of Prolog interpreters. We propose a semantics for Prolog programs based on a four-valued logic. The semantics is based on a new concept of completion analogous to Clark’s and it enjoys the nice properties of the declarat...
متن کاملTowards a Set Oriented Calculus for Logic Programming 1
This paper presents SOCLP (Set Oriented Calculus for Logic Programming), a proof calculus for pure Prolog programs with negation. The main difference of this calculus w.r.t. other related approaches is that it deals with the answer set of a goal as a whole, instead of considering each single answer separately. We prove that SOCLP is well defined, in the sense that, at most, one answer set can b...
متن کاملAnalysis of Pure PROLOG Programs
We deene a new xpoint semantics for pure PROLOG, which is obtained as an instance of the generalized semantics of CLP and is oriented towards abstract interpretation. The semantic domain is composed of sequences of standard and divergent constraints. The semantics is then used as the foundation of a framework for the (bottom-up, goal-independent) abstract interpretation of pure PROLOG programs....
متن کاملProving Hardware Designs
Vhdl is a standardized hardware description language with almost universal market penetration. Originally developed in the 1980s with the support of the US DoD, several formalizations of its hardware simulation semantics have appeared in the last few years, including operational semantics in higher order logic and translations to Petri Nets and finite state machines. But in recent work [1] we h...
متن کاملOptimal Implementation of And-Or Parallel Prology
Most models that have been proposed, or implemented, so far for exploiting both or-parallelism and independent and-parallelism have only considered pure logic programs (pure Prolog). We present an abstract model, called the Composition-Tree, for representing and-or parallelism in full Prolog. The Composition-Tree recomputes independent goals to ensure that Prolog semantics is preserved. We comb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Sci. Comput. Program.
دوره 32 شماره
صفحات -
تاریخ انتشار 1998